Clustering with Euclidean Distance, Manhattan - Distance, Mahalanobis - Euclidean Distance, and Chebyshev Distance with Their Accuracy

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

2D Face Recognition Based on PCA & Comparison of Manhattan Distance, Euclidean Distance & Chebychev Distance

This paper is about human face recognition in image files. Face recognition involves matching a given image with the database of images and identifying the image that it resembles the most. Here, face recognition is done using: (a) Eigen faces and (b) Applying Principal Component Analysis (PCA) on image. The aim is to successfully demonstrate the human face recognition using Principal component...

متن کامل

A Micropower Current-Mode Euclidean Distance Calculator for Pattern Recognition

In this paper a new synthesis for circuit design of Euclidean distance calculation is presented. The circuit is implemented based on a simple two-quadrant squarer/divider block. The circuit that employs floating gate MOS (FG-MOS) transistors operating in weak inversion region, features low circuit complexity, low power (<20uW), low supply voltage (0.5V), two quadrant input current, wide dyn...

متن کامل

Euclidean Distance Reconstruction from Partial Distance Information

Euclidean distance matrix completion problem aims at reconstructing the low dimensional geometry structure of nodes given only a few pairwise distances between nodes [1]. This problem arises in many applications including networks and machine learning where much information of points is laking. For instance, in sensor networks, due to the constraints of energy and communication radius, sensor n...

متن کامل

On Euclidean distance matrices

If A is a real symmetric matrix and P is an orthogonal projection onto a hyperplane, then we derive a formula for the Moore-Penrose inverse of PAP . As an application, we obtain a formula for the MoorePenrose inverse of a Euclidean distance matrix (EDM) which generalizes formulae for the inverse of a EDM in the literature. To an invertible spherical EDM, we associate a Laplacian matrix (which w...

متن کامل

Euclidean and Geodesic Distance Profiles

This paper presents a boundary-based, topological shape descriptor: the distance profile. It is inspired by the LBP (= local binary pattern) scale space – a topological shape descriptor computed by a filtration with concentric circles around a reference point. For rigid objects, the distance profile is computed by the Euclidean distance of each boundary pixel to a reference point. A geodesic di...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Indonesian Journal of Statistics and Its Applications

سال: 2021

ISSN: 2599-0802

DOI: 10.29244/ijsa.v5i2p369-376